A randomized algorithm for the on-line weighted bipartite matching problem

نویسندگان

  • Béla Csaba
  • András Pluhár
چکیده

We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, n not necessary disjoint points of a metric space M are given, and are to be matched on-line with n points of M revealed one by one. The cost of a matching is the sum of the distances of the matched points, and the goal is to find or approximate its minimum. The competitive ratio of the deterministic problem is known to be Θ(n), see [7, 11]. It was conjectured in [8] that a randomized algorithm may perform better against an oblivious adversary, namely with an expected competitive ratio Θ(logn). We prove a slightly weaker result by showing a o(log n) upper bound on the expected competitive ratio. As an application the same upper bound holds for the notoriously hard fire station problem, where M is the real line, see [6, 12].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

M ay 2 00 7 A randomized algorithm for the on - line weighted bipartite matching problem ∗

We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, n not necessary disjoint points of a metric space M are given, and are to be matched on-line with n points of M revealed one by one. The cost of a matching is the sum of the distances of the matched points, and the goal is to find or approximate its minimum. The competitive ratio of the determinis...

متن کامل

On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages

We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number of vertices). This algorithm is optimal – there is no on-line deterministic algorithm that achieves a competitive ratio better than (2n − 1) in all metric spaces. We also study the stable marriage problem, where we are in...

متن کامل

A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane

In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0   are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most ) 1 (   times the optimal solution. In this paper, the authors give a randomized algorithm which follows a...

متن کامل

Online Bipartite Matching with Decomposable Weights

We study a weighted online bipartite matching problem: G(V1, V2, E) is a weighted bipartite graph where V1 is known beforehand and the vertices of V2 arrive online. The goal is to match vertices of V2 as they arrive to vertices in V1, so as to maximize the sum of weights of edges in the matching. If assignments to V1 cannot be changed, no bounded competitive ratio is achievable. We study the we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Scheduling

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2008